Bisimulations for Nondeterministic Labeled Markov Processes
نویسندگان
چکیده
We extend the theory of labeled Markov processes with internal nondeterminism, a fundamental concept for the further development of a process theory with abstraction on nondeterministic continuous probabilistic systems. We define nondeterministic labeled Markov processes (NLMP) and provide three definition of bisimulations: a bisimulation following a traditional characterization, a state based bisimulation tailored to our “measurable” non-determinism, and an event based bisimulation. We show the relation between them, including that the largest state bisimulation is also an event bisimulation. We also introduce a variation of the Hennessy-Milner logic that characterizes event bisimulation and that is sound w.r.t. the other bisimulations for arbitrary NLMP. This logic, however, is infinitary as it contains a denumerable ∨. We then introduce a finitary sublogic that characterize all bisimulations for image finite NLMP whose underlying measure space is also analytic. Hence, in this setting, all notions of bisimulation we deal with turn out to be equal. Finally, we show that all notions of bisimulations are different in the general case. The counterexamples that separate them turn to be non-probabilistic NLMP.
منابع مشابه
Bisimulations and behaviour of nondeterministic automata
The minimization of nondeterministic automata without initial states (developed within a game-theoretic framework in Calude, Calude, Khoussainov [3]) is presented in terms of bisimulations; the minimal automaton is unique up to an isomorphism in case of reversible automata. We also prove that there exists an infinite class of (strongly connected) nondeterministic automata each of which is not b...
متن کاملUniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chains with process terms. The transition relation assigns to each process, for each action, the set of possible futures paired with a measure indicating the rates at which they are reached. RTS have been shown to be a uni...
متن کاملar X iv : 1 10 2 . 54 49 v 1 [ cs . F L ] 2 6 Fe b 20 11 Nondeterministic automata : equivalence , bisimulations , and uniform relations ✩
In this paperwe study the equivalenceofnondeterministic automatapairing the conceptof abisimulationwith the recently introduced concept of a uniform relation. In this symbiosis, uniform relations serve as equivalence relations which relate states of two possibly different nondeterministic automata, and bisimulations ensure compatibility with the transitions, initial and terminal states of these...
متن کاملStrong, Weak and Branching Bisimulation for Transition Systems and Markov Reward Chains: A Unifying Matrix Approach
We first study labeled transition systems with explicit successful termination. We establish the notions of strong, weak, and branching bisimulation in terms of boolean matrix theory, introducing thus a novel and powerful algebraic apparatus. Next we consider Markov reward chains which are standardly presented in real matrix theory. By interpreting the obtained matrix conditions for bisimulatio...
متن کاملBisimulations and Logical Characterizations on Continuous-Time Markov Decision Processes
In this paper we study strong and weak bisimulation equivalences for continuous-time Markov decision processes (CTMDPs) and the logical characterizations of these relations with respect to the continuous-time stochastic logic (CSL). For strong bisimulation, it is well known that it is strictly finer than CSL equivalence. In this paper we propose strong and weak bisimulations for CTMDPs and show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1011.3362 شماره
صفحات -
تاریخ انتشار 2010